ar X iv : 1 40 6 . 59 47 v 1 [ cs . C V ] 2 3 Ju n 20 14 Committees of deep feedforward networks trained with few data

ar X iv : 1 40 6 . 46 48 v 1 [ cs . F L ] 1 8 Ju n 20 14 Optimal Strategy Synthesis for Request - Response Games ∗ Florian Horn

We show the existence and effective computability of optimal winning strategies for request-response games in case the quality of a play is measured by the limit superior of the mean accumulated waiting times between requests and their responses.

Do Deep Neural Networks Suffer from Crowding?

Crowding is a visual effect suffered by humans, in which an object that can be recognized in isolation can no longer be recognized when other objects, called flankers, are placed close to it. In this work, we study the effect of crowding in artificial Deep Neural Networks for object recognition. We analyze both standard deep convolutional neural networks (DCNNs) as well as a new version of DCNN...

ar X iv : 1 10 6 . 26 52 v 1 [ cs . A I ] 1 4 Ju n 20 11 23 Actual Causation and the Art of Modeling

ar X iv : h ep - p h / 00 06 08 2 v 2 1 3 Ju n 20 00 LUNFD 6 / ( NFFL - 7187 ) 2000 PHOTON STRUCTURE AT HERA

The structure of the virtual photon and its contribution to small x processes in deep inelastic scattering at HERA is discussed.

ar X iv : 0 90 6 . 18 47 v 2 [ he p - la t ] 1 1 Ju n 20 09 Physical matrix elements for ∆ I = 3 / 2 channel K → ππ decays

are calculated on the RBC/UKQCD 32 3 × 64, L s = 16 lattices, using 2+1 dynamical flavors and domain wall fermions, with an inverse lattice spacing of a −1 = 2.42(4) GeV. Data is interpolated or extrapolated to energy conserving kinematics and a preliminary calculation of the experimental parameter |A 2 | is performed.